Search results for " optimal control"

showing 10 items of 31 documents

Game Theoretic Decentralized Feedback Controls in Markov Jump Processes

2017

This paper studies a decentralized routing problem over a network, using the paradigm of mean-field games with large number of players. Building on a state-space extension technique, we turn the problem into an optimal control one for each single player. The main contribution is an explicit expression of the optimal decentralized control which guarantees the convergence both to local and to global equilibrium points. Furthermore, we study the stability of the system also in the presence of a delay which we model using an hysteresis operator. As a result of the hysteresis, we prove existence of multiple equilibrium points and analyze convergence conditions. The stability of the system is ill…

0209 industrial biotechnologyMathematical optimizationDecentralized routing policies; Hysteresis; Inverse control problem; Mean-field games; Optimal control; Control and Optimization; Management Science and Operations Research; Applied MathematicsControl and OptimizationStability (learning theory)02 engineering and technologyManagement Science and Operations ResearchMean-field games01 natural sciencesDecentralized routing policie020901 industrial engineering & automationControl theorySettore MAT/05 - Analisi MatematicaMean-field gameConvergence (routing)0101 mathematicsMean field gamesMathematicsEquilibrium pointSettore SECS-S/06 - Metodi mat. dell'economia e Scienze Attuariali e FinanziarieDecentralized routing policies; Hysteresis; Inverse control problem; Mean-field games; Optimal controlApplied MathematicsHysteresis010102 general mathematics[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]Optimal controlOptimal control Mean-field games Inverse control problem Decentralized routing policies HysteresisDecentralised systemOptimal control Mean-field games Inverse control problem Decentralized routing policies HysteresisExpression (mathematics)Optimal controlTheory of computationDecentralized routing policiesHysteresiInverse control problemRouting (electronic design automation)Settore MAT/09 - Ricerca Operativa
researchProduct

Decomposition and Mean-Field Approach to Mixed Integer Optimal Compensation Problems

2016

Mixed integer optimal compensation deals with optimization problems with integer- and real-valued control variables to compensate disturbances in dynamic systems. The mixed integer nature of controls could lead to intractability in problems of large dimensions. To address this challenge, we introduce a decomposition method which turns the original n-dimensional optimization problem into n independent scalar problems of lot sizing form. Each of these problems can be viewed as a two-player zero-sum game, which introduces some element of conservatism. Each scalar problem is then reformulated as a shortest path one and solved through linear programming over a receding horizon, a step that mirro…

0209 industrial biotechnologyMathematical optimizationSpecial ordered setOptimization problemControl and OptimizationLinear programmingBranch and priceApplied Mathematics010102 general mathematics02 engineering and technologyManagement Science and Operations ResearchOptimal control01 natural sciencesOptimal controlMixed integer optimization020901 industrial engineering & automationSettore ING-INF/04 - AutomaticaShortest path problemMean-field gameDecomposition method (constraint satisfaction)0101 mathematicsSettore MAT/09 - Ricerca OperativaMean-field games; Optimal control; Mixed integer optimizationInteger programmingMathematics
researchProduct

Strategic Thinking under social influence: Scalability, stability and robustness of allocations

2016

This paper studies the strategic behavior of a large number of game designers and studies the scalability, stability and robustness of their allocations in a large number of homogeneous coalitional games with transferable utilities (TU). For each TU game, the characteristic function is a continuous-time stochastic process. In each game, a game designer allocates revenues based on the extra reward that a coalition has received up to the current time and the extra reward that the same coalition has received in the other games. The approach is based on the theory of mean-field games with heterogeneous groups in a multi-population regime.

0209 industrial biotechnologyNon-cooperative gameGame mechanicsSequential gameComputer scienceComputingMilieux_PERSONALCOMPUTINGGeneral EngineeringCombinatorial game theory02 engineering and technology01 natural sciencesOptimal control010101 applied mathematicsMicroeconomicsDifferential game020901 industrial engineering & automationMean-field gameRepeated gameSimultaneous gameMean-field games; Coalitional game theory; Differential games; Optimal controlCoalitional game theorySettore MAT/09 - Ricerca Operativa0101 mathematicsVideo game designGame theoryMathematical economics
researchProduct

Sustainable Management of Tourist Flow Networks: A Mean Field Model

2023

In this article, we propose a mean field game approach for modeling the flows of excursionists within a network of tourist attractions. We prove the existence of an equilibrium within the network using a balance ordinary differential equation together with optimality conditions in terms of the value function. We also propose a bi-level formulation of the problem where we aim at achieving a sustainable-oriented control strategy in the upper level and at maximizing excursionists’ satisfaction in the lower level. Our proposed model may provide an effective management tool for local authorities who deal with the challenging problem of finding an optimal control policy to the often conflicting o…

Control and OptimizationSettore SECS-S/06 -Metodi Mat. dell'Economia e d. Scienze Attuariali e Finanz.SustainabilityApplied Mathematicsnetwork flow optimal control mean field game bi-level optimization sustainabilityBi-level optimizationManagement Science and Operations ResearchSettore MAT/09 - Ricerca OperativaBi-level optimization; Mean field game; Network flow optimal control; SustainabilityNetwork flow optimal controlMean field game
researchProduct

A polynomial algorithm solving a special class of hybrid optimal control problems

2006

Hybrid optimal control problems are, in general, difficult to solve. A current research goal is to isolate those problems that lead to tractable solutions [5]. In this paper, we identify a special class of hybrid optimal control problems which are easy to solve. We do this by using a paradigm borrowed from the Operations Research field. As main result, we present a solution algorithm that converges to the exact solution in polynomial time. Our approach consists in approximating the hybrid optimal control problem via an integer-linear programming reformulation. The integer-linear programming problem is a Set-covering one with a totally unimodular constraint matrix and therefore solving the S…

EngineeringMathematical optimizationForce densityComputational complexity theoryLinear programmingbusiness.industrySpecial classOptimal controlPolynomial algorithmControllabilityHybrid optimal controlAlgorithmsHybrid computersInteger programmingLinear control systemsUnimodular matrixControl theoryHuman machine interactionLocal search (optimization)Relaxation (approximation)Settore MAT/09 - Ricerca OperativabusinessInteger programmingTime complexityMathematics2006 IEEE Conference on Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control
researchProduct

Time optimal control of a satellite with two rotors

2001

International audience; The aim of this work is to investigate the structure of time-optimal trajectories for a control system modelizing a satellite with two rotors attached along its two fixed axes. Our results extend to the general case those obtained by Sussmann and Tang in an unpublished paper where they treat a particular case described below. We end up finding a sufficient family of four parameters trajectory types. The main tools used are the Pontryagin Maximum Principle, switching functions and envelope theory. © 2001 EUCA.

Engineeringbusiness.industry010102 general mathematicsWork (physics)Control (management)Structure (category theory)[MATH] Mathematics [math]Time optimal01 natural sciencesStructural optimizationControl theoryTime optimal trajectoryControl systemEnvelope theoryTrajectorySatelliteTime optimal control0101 mathematics[MATH]Mathematics [math]businessEnvelope (motion)
researchProduct

Feedback Classification and Optimal Control with Applications to the Controlled Lotka-Volterra Model

2023

Let M be a σ-compact C^∞ manifold of dimension n ≥ 2 and consider a single-input control system: ẋ(t) = X (x(t)) + u(t) Y (x(t)), where X , Y are C^∞ vector fields on M. We prove that there exist an open set of pairs (X , Y ) for the C^∞ –Whitney topology such that they admit singular abnormal rays so that the spectrum of the projective singular Hamiltonian dynamics is feedback invariant. It is applied to controlled Lotka–Volterra dynamics where such rays are related to shifted equilibria of the free dynamics.

Feedback classificationLotka-Volterra modelFeedback classification Nonlinear systems Lotka-Volterra model Optimal control Direct numerical methodsDirect numerical methodsNonlinear systems[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC][MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]Optimal control
researchProduct

A Sequential Quadratic Programming Method for Volatility Estimation in Option Pricing

2006

Our goal is to identify the volatility function in Dupire's equation from given option prices. Following an optimal control approach in a Lagrangian framework, we propose a globalized sequential quadratic programming (SQP) algorithm with a modified Hessian - to ensure that every SQP step is a descent direction - and implement a line search strategy. In each level of the SQP method a linear-quadratic optimal control problem with box constraints is solved by a primal-dual active set strategy. This guarantees L^1 constraints for the volatility, in particular assuring its positivity. The proposed algorithm is founded on a thorough first- and second-order optimality analysis. We prove the existe…

Hessian matrixMathematical optimizationLine searchComputer scienceMathematicsofComputing_NUMERICALANALYSISOptimal controlsymbols.namesakeValuation of optionsLagrange multipliersymbolsDescent directionVolatility (finance)Dupire equation parameter identification optimal control optimality conditions SQP method primal-dual active set strategySequential quadratic programming
researchProduct

Optimal control and Clairaut-Liouville metrics with applications

2014

The work of this thesis is about the study of the conjugate and cut loci of 2D riemannian or almost-riemannian metrics. We take the point of view of optimal control to apply the Pontryagin Maximum Principle in the purpose of characterize the extremals of the problem considered.We use geometric, numerical and integrability methods to study some Liouville and Clairaut-Liouville metrics on the sphere. In the degenerate case of revolution, the study of the ellipsoid uses geometric methods to fix the cut locus and the nature of the conjugate locus in the oblate and prolate cases. In the general case, extremals will have two distinct type of comportment which correspond to those observed in the r…

Ising chains of spinsLiouville metricsCut LocusContrôle optimal géométrique[ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS][MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS][MATH.MATH-DS] Mathematics [math]/Dynamical Systems [math.DS]Almost-Riemannian geometryChaînes de spins de type IsingGeometric optimal control[ MATH.MATH-DG ] Mathematics [math]/Differential Geometry [math.DG]Conjugate Locus[MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG]Métriques de LiouvilleMétrique pseudo-riemannienneLieu conjugué[MATH.MATH-DG] Mathematics [math]/Differential Geometry [math.DG]Lieu de coupure
researchProduct

Non-linear protocols for optimal distributed consensus in networks of dynamic agents

2006

We consider stationary consensus protocols for networks of dynamic agents with fixed topologies. At each time instant, each agent knows only its and its neighbors'' state, but must reach consensus on a group decision value that is function of all the agents'' initial state. We show that the agents can reach consensus if the value of such a function is time-invariant when computed over the agents'' state trajectories. We use this basic result to introduce a non-linear protocol design rule allowing consensus on a quite general set of values. Such a set includes, e.g., any generalized mean of order p of the agents'' initial states. As a second contribution we show that our protocol design is t…

Lyapunov functionMathematical optimizationDecentralized controlGeneral Computer ScienceConsensus protocols; Decentralized control; Networks; Optimal controlUniform consensussymbols.namesakeConsensusComputer Science::Systems and ControlElectrical and Electronic EngineeringMathematicsMechanism designSupervisorbusiness.industryMechanical EngineeringRational agentDecentralised systemOptimal controlComputer Science::Multiagent SystemsConsensus protocolsControl and Systems EngineeringsymbolsArtificial intelligenceSettore MAT/09 - Ricerca OperativaNetworksbusinessGame theorySystems & Control Letters
researchProduct